Extremal properties of random trees.

نویسندگان

  • E Ben-Naim
  • P L Krapivsky
  • S N Majumdar
چکیده

We investigate extremal statistical properties such as the maximal and the minimal heights of randomly generated binary trees. By analyzing the master evolution equations we show that the cumulative distribution of extremal heights approaches a traveling wave form. The wave front in the minimal case is governed by the small-extremal-height tail of the distribution, and conversely, the front in the maximal case is governed by the large-extremal-height tail of the distribution. We determine several statistical characteristics of the extremal height distribution analytically. In particular, the expected minimal and maximal heights grow logarithmically with the tree size, N, h(min) approximately v(min) ln N, and h(max) approximately v(max) ln N, with v(min)=0.373365ellipsis and v(max)=4.31107ellipsis, respectively. Corrections to this asymptotic behavior are of order O(ln ln N).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extremal Properties of Random Structures

The extremal characteristics of random structures, including trees, graphs, and networks, are discussed. A statistical physics approach is employed in which extremal properties are obtained through suitably defined rate equations. A variety of unusual time dependences and system-size dependences for basic extremal properties are obtained.

متن کامل

On the extremal total irregularity index of n-vertex trees with fixed maximum degree

In the extension of irregularity indices, Abdo et. al. [1] defined the total irregu-larity of a graph G = (V, E) as irrt(G) = 21 Pu,v∈V (G) du − dv, where du denotesthe vertex degree of a vertex u ∈ V (G). In this paper, we investigate the totalirregularity of trees with bounded maximal degree Δ and state integer linear pro-gramming problem which gives standard information about extremal trees a...

متن کامل

Random Walks on Rooted Trees

For arbitrary positive integers h and m, we consider the family of all rooted trees of height h having exactly m vertices at distance h from the root. We refer to such trees as (h,m)-trees. For a tree T from this family, we consider a simple random walk on T which starts at the root and terminates when it visits one of the m vertices at distance h from the root. Consider the problem of finding ...

متن کامل

Profile and Height of Random Binary Search Trees

The purpose of this article is to survey recent results on distributional properties of random binary search trees. In particular we consider the profile and the height.

متن کامل

Extremal and Probabilistic Combinatorics

09:20 – 09:30 Opening remarks 09:30 – 10:00 Dhruv Mubayi Quasirandom hypergraphs 10:05 – 10:35 Yufei Zhao Sparse regularity and counting in pseudorandom graphs 10:35 – 11:15 Coffee 11:15 – 11:45 Asaf Shapira Exact bounds for some hypergraph saturation problems 11:50 – 12:20 Po-Shen Loh Computing with voting trees 12:20 – 14:30 Lunch 14:30 – 15:00 Joel Spencer Six standard deviations still suffi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Physical review. E, Statistical, nonlinear, and soft matter physics

دوره 64 3 Pt 2  شماره 

صفحات  -

تاریخ انتشار 2001